13 research outputs found
Recommended from our members
An integrated proteomic and metabolomic approach to investigate cerebral ischemic preconditioning
The molecular mechanism that leads to ischemic preconditioning and hence to ischemic tolerance, are not completely understood although it is clear that multiple effectors and pathways contribute to the instauration of this neuroprotective profile. To study the mechanism/pathway involved in the ischemic tolerance, brain proteins, plasma proteins and plasma metabolites were analyzed in preconditioning stimulus (7'Middle Cerebral Artery occlusion or 7'MCAo), in severe stroke and (permanent Middle Cerebral Artery occlusion or pMCAo) and in preconditioned (7'MCAo/pMCAo) mouse model.
A conventional 2-DE approach was used to study technical replicates of pooled brain proteins revealing an involvement of energy metabolism, mitochondrial electron transport, synaptic vesicle transport and antioxidant processes; moreover network analysis suggested an involvement of the androgen receptor that was validated on technical replicates of pooled brain proteins by western blot analysis revealing an increased expression in preconditioned stimulus animals (7'MCAo).
Plasma proteins were analyzed using a i-DE LC-MS/MS approach on technical replicates of pooled plasma proteins revealing decreased levels of epidermal growth factor receptor (EGFR) and increased levels of insuline like growth factor acid labile subunit (IGFALS), which expression was paralleled by increased insulin like growth factor 1 (IGFi) plasma concentration, as validated by ELISA on biological replicates, in preconditioning stimulus animals (7'MCAo).
Finally an untarget metabolomics analysis was applied to technical replicates of pooled plasma proteins revealing fatty acid oxidation and branched-chain aminoacid metabolism as the main biological processes modulated in ischemic tolerance and highlighted an involvement of the aminoacid leucine, carnitine esters and adenosine.
The results described in this thesis represents the first application of both proteomic and metabolomic approaches in cerebral ischemic sets, highlighting the androgen receptor as an important mediator between proteins and metabolites and adding new evidence to the current knowledge on ischemic preconditioning that may represent a starting point for future experiments on investigating candidate pathways that relate to the Androgen receptor
Rational Fair Consensus in the GOSSIP Model
The \emph{rational fair consensus problem} can be informally defined as
follows. Consider a network of (selfish) \emph{rational agents}, each of
them initially supporting a \emph{color} chosen from a finite set .
The goal is to design a protocol that leads the network to a stable
monochromatic configuration (i.e. a consensus) such that the probability that
the winning color is is equal to the fraction of the agents that initially
support , for any . Furthermore, this fairness property must
be guaranteed (with high probability) even in presence of any fixed
\emph{coalition} of rational agents that may deviate from the protocol in order
to increase the winning probability of their supported colors. A protocol
having this property, in presence of coalitions of size at most , is said to
be a \emph{whp\,--strong equilibrium}. We investigate, for the first time,
the rational fair consensus problem in the GOSSIP communication model where, at
every round, every agent can actively contact at most one neighbor via a
\emph{pushpull} operation. We provide a randomized GOSSIP protocol that,
starting from any initial color configuration of the complete graph, achieves
rational fair consensus within rounds using messages of
size, w.h.p. More in details, we prove that our protocol is a
whp\,--strong equilibrium for any and, moreover, it
tolerates worst-case permanent faults provided that the number of non-faulty
agents is . As far as we know, our protocol is the first solution
which avoids any all-to-all communication, thus resulting in message
complexity.Comment: Accepted at IPDPS'1
Cutting Bamboo down to Size
This paper studies the problem of programming a robotic panda gardener to keep a bamboo garden from obstructing the view of the lake by your house.
The garden consists of n bamboo stalks with known daily growth rates and the gardener can cut at most one bamboo per day. As a computer scientist, you found out that this problem has already been formalized in [G?sieniec et al., SOFSEM\u2717] as the Bamboo Garden Trimming (BGT) problem, where the goal is that of computing a perpetual schedule (i.e., the sequence of bamboos to cut) for the robotic gardener to follow in order to minimize the makespan, i.e., the maximum height ever reached by a bamboo.
Two natural strategies are Reduce-Max and Reduce-Fastest(x). Reduce-Max trims the tallest bamboo of the day, while Reduce-Fastest(x) trims the fastest growing bamboo among the ones that are taller than x. It is known that Reduce-Max and Reduce-Fastest(x) achieve a makespan of O(log n) and 4 for the best choice of x = 2, respectively. We prove the first constant upper bound of 9 for Reduce-Max and improve the one for Reduce-Fastest(x) to (3+?5)/2 < 2.62 for x = 1+1/?5.
Another critical aspect stems from the fact that your robotic gardener has a limited amount of processing power and memory. It is then important for the algorithm to be able to quickly determine the next bamboo to cut while requiring at most linear space. We formalize this aspect as the problem of designing a Trimming Oracle data structure, and we provide three efficient Trimming Oracles implementing different perpetual schedules, including those produced by Reduce-Max and Reduce-Fastest(x)
Distributed Community Detection via Metastability of the 2-Choices Dynamics
We investigate the behavior of a simple majority dynamics on networks of
agents whose interaction topology exhibits a community structure. By leveraging
recent advancements in the analysis of dynamics, we prove that, when the states
of the nodes are randomly initialized, the system rapidly and stably converges
to a configuration in which the communities maintain internal consensus on
different states. This is the first analytical result on the behavior of
dynamics for non-consensus problems on non-complete topologies, based on the
first symmetry-breaking analysis in such setting. Our result has several
implications in different contexts in which dynamics are adopted for
computational and biological modeling purposes. In the context of Label
Propagation Algorithms, a class of widely used heuristics for community
detection, it represents the first theoretical result on the behavior of a
distributed label propagation algorithm with quasi-linear message complexity.
In the context of evolutionary biology, dynamics such as the Moran process have
been used to model the spread of mutations in genetic populations [Lieberman,
Hauert, and Nowak 2005]; our result shows that, when the probability of
adoption of a given mutation by a node of the evolutionary graph depends
super-linearly on the frequency of the mutation in the neighborhood of the node
and the underlying evolutionary graph exhibits a community structure, there is
a non-negligible probability for species differentiation to occur.Comment: Full version of paper appeared in AAAI-1
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks
Consider the following process on a network: Each agent initially holds
either opinion blue or red; then, in each round, each agent looks at two random
neighbors and, if the two have the same opinion, the agent adopts it. This
process is known as the 2-Choices dynamics and is arguably the most basic
non-trivial opinion dynamics modeling voting behavior on social networks.
Despite its apparent simplicity, 2-Choices has been analytically characterized
only on networks with a strong expansion property -- under assumptions on the
initial configuration that establish it as a fast majority consensus protocol.
In this work, we aim at contributing to the understanding of the 2-Choices
dynamics by considering its behavior on a class of networks with core-periphery
structure, a well-known topological assumption in social networks. In a
nutshell, assume that a densely-connected subset of agents, the core, holds a
different opinion from the rest of the network, the periphery. Then, depending
on the strength of the cut between the core and the periphery, a
phase-transition phenomenon occurs: Either the core's opinion rapidly spreads
among the rest of the network, or a metastability phase takes place, in which
both opinions coexist in the network for superpolynomial time. The interest of
our result is twofold. On the one hand, by looking at the 2-Choices dynamics as
a simplistic model of competition among opinions in social networks, our
theorem sheds light on the influence of the core on the rest of the network, as
a function of the core's connectivity towards the latter. On the other hand, to
the best of our knowledge, we provide the first analytical result which shows a
heterogeneous behavior of a simple dynamics as a function of structural
parameters of the network. Finally, we validate our theoretical predictions
with extensive experiments on real networks
Consensus vs Broadcast, with and without Noise
International audienceConsensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast , and this can be rigorously established in several models. Can Consensus be easier than Broadcast? In models that allow noiseless communication, we prove a reduction of (a suitable variant of) Broadcast to binary Consensus, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol. Using this reduction, we get, among other applications, the first logarithmic lower bound on the number of rounds needed to achieve Consensus in the uniform GOSSIP model on the complete graph. The lower bound is tight and, in this model, Consensus and Broadcast are equivalent. We then turn to distributed models with noisy communication channels that have been studied in the context of some bio-inspired systems. In such models, only one noisy bit is exchanged when a communication channel is established between two nodes, and so one cannot easily simulate a noiseless protocol by using error-correcting codes. An Ω(ε −2 n) lower bound on the number of rounds needed for Broadcast is proved by Boczkowski et al. [PLOS Comp. Bio. 2018] in one such model (noisy uniform PULL, where ε is a parameter that measures the amount of noise). We prove an O(ε −2 log n) upper bound for binary Consensus in such model, thus establishing an exponential gap between the number of rounds necessary for Consensus versus Broadcast. We also prove a new O(ε −2 n log n) upper bound for Broadcast in this model
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors
The Undecided-State Dynamics is a well-known protocol for distributed consensus. We analyze it in the parallel PULL communication model on the complete graph with n nodes for the binary case (every node can either support one of two possible colors, or be in the undecided state).
An interesting open question is whether this dynamics is an efficient Self-Stabilizing protocol, namely, starting from an arbitrary initial configuration, it reaches consensus quickly (i.e., within a polylogarithmic number of rounds). Previous work in this setting only considers initial color configurations with no undecided nodes and a large bias (i.e., Theta(n)) towards the majority color.
In this paper we present an unconditional analysis of the Undecided-State Dynamics that answers to the above question in the affirmative. We prove that, starting from any initial configuration, the process reaches a monochromatic configuration within O(log n) rounds, with high probability. This bound turns out to be tight. Our analysis also shows that, if the initial configuration has bias Omega(sqrt(n log n)), then the dynamics converges toward the initial majority color, with high probability
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks
International audienc
Phase transition of the 2-Choices dynamics on core–periphery networks
International audienceAbstract The 2-Choices dynamics is a process that models voting behavior on networks and works as follows: Each agent initially holds either opinion blue or red ; then, in each round, each agent looks at two random neighbors and, if the two have the same opinion, the agent adopts it. We study its behavior on a class of networks with core–periphery structure. Assume that a densely-connected subset of agents, the core , holds a different opinion from the rest of the network, the periphery . We prove that, depending on the strength of the cut between core and periphery, a phase-transition phenomenon occurs: Either the core’s opinion rapidly spreads across the network, or a metastability phase takes place in which both opinions coexist for superpolynomial time. The interest of our result, which we also validate with extensive experiments on real networks, is twofold. First, it sheds light on the influence of the core on the rest of the network as a function of its connectivity toward the latter. Second, it is one of the first analytical results which shows a heterogeneous behavior of a simple dynamics as a function of structural parameters of the network